An Approximate 0-1 Edge-Labeling Algorithm for Constrained Bin-Packing Problem
نویسندگان
چکیده
This paper describes a constrained bin-packing •problem (CBPP) and an approximate, anytime algor i thm for solutions. A CBPP is a constrained version of the bin-packing problem, in which a set of items allocated to a bin are ordered in a way to satisfy constraints defined on them and achieve near-optimality. The algor i thm for CBPP uses a heuristic search for labeling edges w i th a binary value, together w i th a beam search and constraint propagat ion. Some experimental results are provided. This a lgor i thm has been successfully applied to industrial-scale scheduling problems.
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملDistributionally Robust Chance-Constrained Bin Packing
Chance-constrained bin packing problem allocates a set of items into bins and, for each bin, bounds the probability that the total weight of packed items exceeds the bin’s capacity. Different from the stochastic programming approaches relying on full distributional information of the random item weights, we assume that only the information of the mean and covariance matrix is available. Accordi...
متن کاملAn experimental comparison of some heuristics for cardinality constrained bin packing problem
Background: Bin packing is an NP hard optimization problem of packing items of given sizes into minimum number of capacity limited bins. Besides the basic problem, numerous other variants of bin packing exist. The cardinality constrained bin packing adds an additional constraint that the number of items in a bin must not exceed a given limit Nmax. Objectives: Goal of the paper is to present a p...
متن کاملA note on dual approximation algorithms for class constrained bin packing problems
In this paper we present a dual approximation scheme for the class constrained shelf bin packing problem. In this problem, we are given bins of capacity 1, and n items of Q different classes, each item e with class ce and size se. The problem is to pack the items into bins, such that two items of different classes packed in a same bin must be in different shelves. Items in a same shelf are pack...
متن کاملOn the bin packing problem with a fixed number of object weights
We consider a bin packing problem where the number of different object weights is fixed to C. We analyze a simple approximate approach and show that it leads to an asymptotically exact polynomial algorithm with absolute error 0 if C = 2, at most 1 if 1 < C ≤ 6, and at most 1 + b(C − 1)/3c if C > 6. A consequence of our analysis is a new upper bound on the gap between the optimal value of the pr...
متن کامل